Deterministic Parallel DPLL
نویسندگان
چکیده
منابع مشابه
Deterministic Parallel DPLL
Current parallel SAT solvers suffer from a non-deterministic behavior. This is the consequence of their architectures which rely on weak synchronizing in an attempt to maximize performance. This behavior is a clear downside for practitioners, who are used to both runtime and solution reproducibility. In this paper, we propose the first Deterministic Parallel DPLL engine. Our experimental result...
متن کاملAbstract DPLL and Abstract DPLL Modulo Theories
DPLL and Abstract DPLL Modulo TheoriesDPLL Modulo Theories Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli ?? Abstract. We introduce Abstract DPLL, a general and simple abstract We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davis-Putnam-Logemann-Loveland (DPLL) procedure. Its properties, such as soundness, completeness or termination, immediatel...
متن کاملDeterministic Parallel FORTRAN
We describe Fortran M, message-passing extensions to Fortran 77 that provide deterministic execution and information hiding while preserving desirable properties of message passing.
متن کاملDeterministic parallel analysis
Factor analysis is widely used in many application areas. The first step, choosing the number of factors, remains a serious challenge. One of the most popular methods is parallel analysis (PA), which compares the observed factor strengths to simulated ones under a noise-only model. This paper presents a deterministic version of PA (DPA), which is faster and more reproducible than PA. We show th...
متن کاملImproved Deterministic Parallel Padded Sorting
Given an input array of n real numbers, sorting with padding consists in writing those numbers in order in an array of size (1 +)n, thus leaving n entries empty. Only comparisons are allowed between the numbers to be sorted. We describe an algorithm that, with nk processors in the CRCW PRAM model, sorts the input array with padding o(1) using time O(log k n log (log k n) + loglog k). This impro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal on Satisfiability, Boolean Modeling and Computation
سال: 2011
ISSN: 1574-0617
DOI: 10.3233/sat190081